Quasi-cyclic Flexible Regenerating Codes
نویسندگان
چکیده
In a distributed storage environment, where the data is placed in nodes connected through a network, it is likely that one of these nodes fails. It is known that the use of erasure coding improves the fault tolerance and minimizes the redundancy added in distributed storage environments. The use of regenerating codes not only make the most of the erasure coding improvements, but also minimizes the amount of data needed to regenerate a failed node. In this paper, a new family of regenerating codes based on quasi-cyclic codes is presented. Quasi-cyclic flexible minimum storage regenerating (QCFMSR) codes are constructed and their existence is proved. Quasi-cyclic flexible regenerating codes with minimum bandwidth constructed from a base QCFMSR code are also provided. These codes not only achieve optimal MBR parameters in terms of stored data and repair bandwidth, but also for an specific choice of the parameters involved, they can be decreased under the optimal MBR point. Quasi-cyclic flexible regenerating codes are very interesting because of their simplicity and low complexity. They allow exact repair-by-transfer in the minimum bandwidth case and an exact pseudo repair-by-transfer in the MSR case, where operations are needed only when a new node enters into the system replacing a lost one.
منابع مشابه
Hybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملQuasi-cyclic Minimum Bandwidth Regenerating Codes
In a distributed storage environment the data file is not placed in just one but in more than one devices which are connected through a network. There are many examples such as RAID systems and Internet storage applications. When data needs to be stored, there is usually one issue it needs to be faced: the availability of such data. Basically, this data needs to be persistent over time and resi...
متن کاملOn the Codes over a Semilocal Finite Ring
In this paper, we study the structure of cyclic, quasi cyclic, constacyclic codes and their skew codes over the finite ring R. The Gray images of cyclic, quasi cyclic, skew cyclic, skew quasi cyclic and skew constacyclic codes over R are obtained. A necessary and sufficient condition for cyclic (negacyclic) codes over R that contains its dual has been given. The parameters of quantum error corr...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012